منابع مشابه
Efficient Delay Routing
In this paper the computational complexity of finding packet routing schemes provably efficient with respect to the end-to-end delay is studied. The attention is focused on polynomial-time algorithms able to optimize the end-to-end delay when the number of packets in the network increases, and the number of packets that can be accepted in the network in order to keep the endto-end delay within ...
متن کاملAn Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and tens of heuristics have been developed to solve this NP-complete problem. Among all the previously proposed algorithms, the bounded shortest path algorithm (BSMA) [15] have proved to be capable of producing a multicast t...
متن کاملEnergy efficient routing with delay guarantee for sensor networks
The paper presents a routing algorithm that maximizes the lifetime of a sensor network in which all data packets are destined to a single collection node. Lifetime is maximized by adjusting the number of packets traversing each node. The adjustment is carried out by transmitting over alternative routes. First part of the paper assumes that the worst case delay resulting from energy efficient ro...
متن کاملEfficient Routing using Bubble Rap in Delay Tolerant Network
Intermittently connected mobile ad-hoc networks are kind of wireless networks where end to end connectivity unlikely exists. Routing in such environment is carried out through the store-carry-forward mechanism. Thus, message delivery relies on node’s mobility, their contact opportunities and contact patterns. Intermittently connected mobile ad-hoc networks can be viewed as dynamic graph, where ...
متن کاملEfficient Routing using Bubble Rap in Delay Tolerant Network
Intermittently connected mobile ad-hoc networks are kind of wireless networks where end to end connectivity unlikely exists. Routing in such environment is carried out through the store-carry-forward mechanism. Thus, message delivery relies on node’s mobility, their contact opportunities and contact patterns. Intermittently connected mobile ad-hoc networks can be viewed as dynamic graph, where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00198-9